A Routing Calculus with Distance Vector Routing Updates
نویسندگان
چکیده
منابع مشابه
A Routing Calculus with Flooding Updates
We propose a process calculus which explicitly models routing in a distributed computer network. We define a model which consists of a network of routers where the topology of routers is fixed. The calculus has three syntactic categories namely processes, nodes and systems. Processes reside in nodes which are connected to a specific routers which forms a system. Upon creation of new nodes, the ...
متن کاملSecuring Distance-vector Routing Protocols Securing Distance-vector Routing Protocols
The security requirements of distance-vector routing protocols are analyzed, their vulnerabilities identi ed, and countermeasures to these vulnerabilities are proposed. The innovation presented involves the use of mechanisms from the pathnding class of distancevector protocols as a solution to the security problems of distance-vector protocols. The result is the rst proposal to e ectively and e...
متن کاملSecuring Distance-Vector Routing Protocols
We analyze the security requirements of distance-vector routing protocols, identify their vulnerabilities, and propose countermeasures to these vulnerabilities. The innovation we propose involves the use of mechanisms from the path-finding class of distance-vector protocols as a solution to the security problems of distance-vector protocols. The result is a proposal that effectively and efficie...
متن کاملSecured Distance Vector Routing (SDVR)
A mobile ad hoc network (MANET) is a collection of wireless mobile nodes dynamically shaping a provisional network devoid of the use of any existing network infrastructure or centralized management. In MANETs, security is the major challenge due to the dynamic topology which is because of the mobility of the nodes. In this paper, we propose to design and develop a secure methodology incorporate...
متن کاملMDVA: A Distance-Vector Multipath Routing Protocol
Routing protocols using the Distributed Bellman-Ford (DBF) algorithm converge very slowly to the correct routes when link costs increase, and in the case when a set of link failures results in a network partition, DBF simply fails to converge, a problem which is commonly referred to as the count-to-infinity problem. In this paper, we present the first distance vector routing algorithm MDVA that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2018
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2018.091067